The Method of Infinite Descent in Stable

نویسندگان

  • HIROFUMI NAKAI
  • DOUGLAS C. RAVENEL
چکیده

This paper is a continuation of [Rav02] and the second in a series of papers intended to clarify and expand results of the last chapter of [Rav04], in which we described a method for computing the Adams-Novikov E2-term and used it to determine the stable homotopy groups of spheres through dimension 108 for p = 3 and 999 for p = 5. The latter computation was a substantial improvement over prior knowledge, and neither has been improved upon since. It is generally agreed among homotopy theorists that it is not worthwhile to try to improve our knowledge of stable homotopy groups by a few stems, but that the prospect of increasing the known range by a factor of p would be worth pursuing. This possibility may be within reach now, due to a better understanding of the methods of [Rav04] Chapter 7 and improved computer technology. This paper should be regarded as laying the foundation for a program to compute π∗(S) through roughly dimension p|v2|, i.e., 432 for p = 3 and 6,000 for p = 5. We will refer to results from [Rav02] freely as if they were in the first four sections of this paper, which begins with Section 5.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Designing stable neural identifier based on Lyapunov method

The stability of learning rate in neural network identifiers and controllers is one of the challenging issues which attracts great interest from researchers of neural networks. This paper suggests adaptive gradient descent algorithm with stable learning laws for modified dynamic neural network (MDNN) and studies the stability of this algorithm. Also, stable learning algorithm for parameters of ...

متن کامل

Concepts and Application of Three Dimensional Infinite Elements to Soil Structure-Interaction Problems

This study is concerned with the formulation of three dimensional mapped infinite elements with 1/r and 1/ decay types. These infinite elements are coupled with conventional finite elements and their application to some problems of soil structure interaction are discussed. The effeciency of the coupled finite-infinite elements formulation with respect to computational effort, data preparation a...

متن کامل

A Free Line Search Steepest Descent Method for Solving Unconstrained Optimization Problems

In this paper, we solve unconstrained optimization problem using a free line search steepest descent method. First, we propose a double parameter scaled quasi Newton formula for calculating an approximation of the Hessian matrix. The approximation obtained from this formula is a positive definite matrix that is satisfied in the standard secant relation. We also show that the largest eigen value...

متن کامل

Moving Average Processes with Infinite Variance

The sample autocorrelation function (acf) of a stationary process has played a central statistical role in traditional time series analysis, where the assumption is made that the marginal distribution has a second moment. Now, the classical methods based on acf are not applicable in heavy tailed modeling. Using the codifference function as dependence measure for such processes be shown it be as...

متن کامل

Hybrid steepest-descent method with sequential and functional errors in Banach space

Let $X$ be a reflexive Banach space, $T:Xto X$ be a nonexpansive mapping with $C=Fix(T)neqemptyset$ and $F:Xto X$ be $delta$-strongly accretive and $lambda$- strictly pseudocotractive with $delta+lambda>1$. In this paper, we present modified hybrid steepest-descent methods, involving sequential errors and functional errors with functions admitting a center, which generate convergent sequences ...

متن کامل

A Robust Distributed Estimation Algorithm under Alpha-Stable Noise Condition

Robust adaptive estimation of unknown parameter has been an important issue in recent years for reliable operation in the distributed networks. The conventional adaptive estimation algorithms that rely on mean square error (MSE) criterion exhibit good performance in the presence of Gaussian noise, but their performance drastically decreases under impulsive noise. In this paper, we propose a rob...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008